Combinatorial Auctions. Edited by Peter

نویسندگان

  • LAKSHMI IYER
  • Richard Steinberg
چکیده

nal intervention are most effective, remain open questions. Overall, these volumes are a valuable resource for all researchers interested in studying civil wars. REFERENCES Collier, Paul and Anke Hoeffler. 1998. “On Economic Causes of Civil War.” Oxford Economic Papers, 50(4): 563–73. Collier, Paul and Anke Hoeffler. 2004. “Greed and Grievance in Civil War.” Oxford Economic Papers, 56(4): 563–95. Fearon, James D., and David D. Laitin. 2003. “Ethnicity, Insurgency, and Civil War.” American Political Science Review, 97(1): 75–90. Sambanis, Nicholas. 2004. “What Is Civil War? Conceptual and Empirical Complexities of an Operational Definition.” Journal of Conflict Resolution, 48(6): 814–58. LAKSHMI IYER Harvard University

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions

We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...

متن کامل

Introduction to Combinatorial Auctions

Combinatorial auctions are those auctions in which bidders can place bids on combinations of items, called “packages,” rather than just individual items. The study of combinatorial auctions is inherently interdisciplinary. Combinatorial auctions are in the first place auctions, a topic extensively studied by economists. Package bidding brings in operations research, especially techniques from c...

متن کامل

Research Problems in Combinatorial Auctions

Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes, network routing and furniture. Because of complementarities or substitution effects between the different assets, bidders have preferences not just for particular items but for sets of items. For this reason, economic efficiency is enhanced if bidders are allowed to bid on bundles o...

متن کامل

Development of a Genetic Algorithm for Advertising Time Allocation Problems

Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007